Device Locks: Mutual Exclusion for Storage Area Networks
نویسندگان
چکیده
Device Locks are mechanisms used in distributed environments to facilitate mutual exclusion of shared resources. They can further be used to maintain coherence of data that is cached in several locations. The locks are implemented on the storage devices and accessed with the SCSI device lock command, Dlock. This paper presents the Dlock command and discusses how it can be used as a mutual exclusion device for Storage Area Networks and Shared Disk File Systems. Methods for the recovery of a Dlock held by a failed initiator are also presented. The Dlock command is in the process of being standardized as part of the SCSI 3 specification.
منابع مشابه
Loch-Ness: A Lock Free Method using Virtual Memory Page Table Entry Mechanism
Operating Systems have offered Locking as a de-facto mechanism for mutual exclusion. Locks have enjoyed widespread use due to their simplicity. However the burden of protecting a critical section is left to the programmer. Programmer has to ensure that the Locks are created, acquired, released and destroyed after use. Incorrect use of Locks can lead to race conditions. In Multi-programming, par...
متن کاملReader-Writer Locks for Network Attached Storage and Storage Area Networks
Emerging large-scale data-storage technologies such as Storage Area Networks (SAN) and Network Attached Storage (NAS), being server-less, trade datasharing and security semantics for high throughput and availability. This paper addresses the issue of data-sharing by presenting a Reader-Writer locking mechanism that is controlled by the storage device. Shared-read and exclusive-write access to s...
متن کاملOptimized Lock Assignment and Allocation for Productivity: A Method for Exploiting Concurrency among Critical Sections
One of the major productivity issues in parallel programming arises from the use of lock/unlock operations or atomic/critical sections to enforce mutual exclusion. Not only are these constructs complicated to understand and debug, but they are also often an impediment to achieving scalable parallelism. In this paper, we propose to give the programmer the convenience of critical sections combine...
متن کاملAbortable Reader-Writer Locks Are No More Complex Than Abortable Mutex Locks
When a process attempts to acquire a mutex lock, it may be forced to wait if another process currently holds the lock. In certain applications, such as real-time operating systems and databases, indefinite waiting can cause a process to miss an important deadline [20]. Hence, there has been research on designing abortable mutual exclusion locks, and fairly efficient algorithms of O(log n) RMR c...
متن کاملScalable Reader-Writer Synchronization for Shared-Memory Multiprocessors
Reader-writer synchronization relaxes the constraints of mutual exclusion to permit more than one process to inspect a shared object concurrently, as long as none of them changes its value. On uniprocessors, mutual exclusion and readerwriter locks are typically designed to de-schedule blocked processes; however, on shared-memory multiprocessors it is often advantageous to have processes busy wa...
متن کاملذخیره در منابع من
با ذخیره ی این منبع در منابع من، دسترسی به آن را برای استفاده های بعدی آسان تر کنید
عنوان ژورنال:
دوره شماره
صفحات -
تاریخ انتشار 1999